Improved Implementation of Point Location in General Two-Dimensional Subdivisions

We present a major revamp of the point-location data structure for general two-dimensional subdivisions via randomized incremental construction, implemented in CGAL, the Computational Geometry Algorithms Library. We can now guarantee that the constructed directed acyclic graph G is of linear size and provides logarithmic query time. Via the construction of the Voronoi diagram for a given point set S of size n, this also enables nearest-neighbor queries in guaranteed O(log n) time. Another major innovation is the support of general unbounded subdivisions as well as subdivisions of two-dimensional parametric surfaces such as spheres, tori, cylinders. The implementation is exact, complete, and general, i.e., it can also handle non-linear subdivisions. Like the previous version, the data structure supports modifications of the subdivision, such as insertions and deletions of edges, after the initial preprocessing. A major challenge is to retain the expected O(n log n) preprocessing time while providing the above (deterministic) space and query-time guarantees. We describe an efficient preprocessing algorithm, which explicitly verifies the length L of the longest query path in O(n log n) time. However, instead of using L, our implementation is based on the depth D of G. Although we prove that the worst case ratio of D and L is Theta(n/log n), we conjecture, based on our experimental results, that this solution achieves expected O(n log n) preprocessing time.Comment: 21 page

Designing difficult office space allocation problem instances with mathematical programming

Office space allocation (OSA) refers to the assignment of room space to a set of entities (people, machines, roles, etc.), with the goal of optimising the space utilisation while satisfying a set of additional constraints. In this paper, a mathematical programming approach is developed to model and generate test instances for this difficult and important combinatorial optimisation problem. Systematic experimentation is then carried out to study the difficulty of the generated test instances when the parameters for adjusting space misuse (overuse and underuse) and constraint violations are subject to variation. The results show that the difficulty of solving OSA problem instances can be greatly affected by the value of these parameters

Constructing Delaunay triangulations along space-filling curves

Incremental construction con BRIO using a space-filling curve order for insertion is a popular algorithm for constructing Delaunay triangulations. So far, it has only been analyzed for the case that a worst-case optimal point location data structure is used which is often avoided in implementations. In this paper, we analyze its running time for the more typical case that points are located by walking. We show that in the worst-case the algorithm needs quadratic time, but that this can only happen in degenerate cases. We show that the algorithm runs in O(n logn) time under realistic assumptions. Furthermore, we show that it runs in expected linear time for many random point distributions. This research was supported by the Deutsche Forschungsgemeinschaft within the European graduate program ’Combinatorics, Geometry, and Computation’ (No. GRK 588/2) and by the Netherlands’ Organisation for Scientific Research (NWO) under BRICKS/FOCUS grant number 642.065.503 and project no. 639.022.707

Antimicrobials: a global alliance for optimizing their rational use in intra-abdominal infections (agora)

Intra-abdominal infections (IAI) are an important cause of morbidity and are frequently associated with poor prognosis, particularly in high-risk patients. The cornerstones in the management of complicated IAIs are timely effective source control with app1133132sem informaçãosem informaçã

On the complexity of strongly connected components in directed hypergraphs

We study the complexity of some algorithmic problems on directed hypergraphs and their strongly connected components (SCCs). The main contribution is an almost linear time algorithm computing the terminal strongly connected components (i.e. SCCs which do not reach any components but themselves). "Almost linear" here means that the complexity of the algorithm is linear in the size of the hypergraph up to a factor alpha(n), where alpha is the inverse of Ackermann function, and n is the number of vertices. Our motivation to study this problem arises from a recent application of directed hypergraphs to computational tropical geometry. We also discuss the problem of computing all SCCs. We establish a superlinear lower bound on the size of the transitive reduction of the reachability relation in directed hypergraphs, showing that it is combinatorially more complex than in directed graphs. Besides, we prove a linear time reduction from the well-studied problem of finding all minimal sets among a given family to the problem of computing the SCCs. Only subquadratic time algorithms are known for the former problem. These results strongly suggest that the problem of computing the SCCs is harder in directed hypergraphs than in directed graphs.Comment: v1: 32 pages, 7 figures; v2: revised version, 34 pages, 7 figure

New method to find corner and tangent vertices in sketches using parametric cubic curves approximation

Some recent approaches have been presented as simple and highly accurate corner finders in the sketches including curves, which is useful to support natural human-computer interaction, but these in most cases do not consider tangent vertices (smooth points between two geometric entities, present in engineering models), what implies an important drawback in the field of design. In this article we present a robust approach based on the approximation to parametric cubic curves of the stroke for further radius function calculation in order to detect corner and tangent vertices. We have called our approach Tangent and Corner Vertices Detection (TCVD), and it works in the following way. First, corner vertices are obtained as minimum radius peaks in the discrete radius function, where radius is obtained from differences. Second, approximated piecewise parametric curves on the stroke are obtained and the analytic radius function is calculated. Then, curves are obtained from stretches of the stroke that have a small radius. Finally, the tangent vertices are found between straight lines and curves or between curves, where no corner vertices are previously located. The radius function to obtain curves is calculated from approximated piecewise curves, which is much more noise free than discrete radius calculation. Several tests have been carried out to compare our approach to that of the current best benchmarked, and the obtained results show that our approach achieves a significant accuracy even better finding corner vertices, and moreover, tangent vertices are detected with an Accuracy near to 92% and a False Positive Rate near to 2%.Spanish Ministry of Science and Education and the FEDER Funds, through CUESKETCH (Ref. DPI2007-66755-C02-01) and HYMAS projects (Ref. DPI2010-19457) partially supported this work.Albert Gil, FE.; García Fernández-Pacheco, D.; Aleixos Borrás, MN. (2013). New method to find corner and tangent vertices in sketches using parametric cubic curves approximation. Pattern Recognition. 46(5):1433-1448. https://doi.org/10.1016/j.patcog.2012.11.006S1433144846

Random Convex Hulls and Extreme Value Statistics

In this paper we study the statistical properties of convex hulls of $N$ random points in a plane chosen according to a given distribution. The points may be chosen independently or they may be correlated. After a non-exhaustive survey of the somewhat sporadic literature and diverse methods used in the random convex hull problem, we present a unifying approach, based on the notion of support function of a closed curve and the associated Cauchy's formulae, that allows us to compute exactly the mean perimeter and the mean area enclosed by the convex polygon both in case of independent as well as correlated points. Our method demonstrates a beautiful link between the random convex hull problem and the subject of extreme value statistics. As an example of correlated points, we study here in detail the case when the points represent the vertices of $n$ independent random walks. In the continuum time limit this reduces to $n$ independent planar Brownian trajectories for which we compute exactly, for all $n$, the mean perimeter and the mean area of their global convex hull. Our results have relevant applications in ecology in estimating the home range of a herd of animals. Some of these results were announced recently in a short communication [Phys. Rev. Lett. {\bf 103}, 140602 (2009)].Comment: 61 pages (pedagogical review); invited contribution to the special issue of J. Stat. Phys. celebrating the 50 years of Yeshiba/Rutgers meeting

Computing pseudotriangulations via branched coverings

We describe an efficient algorithm to compute a pseudotriangulation of a finite planar family of pairwise disjoint convex bodies presented by its chirotope. The design of the algorithm relies on a deepening of the theory of visibility complexes and on the extension of that theory to the setting of branched coverings. The problem of computing a pseudotriangulation that contains a given set of bitangent line segments is also examined.Comment: 66 pages, 39 figure

The Theory of Brown Dwarfs and Extrasolar Giant Planets

Straddling the traditional realms of the planets and the stars, objects below the edge of the main sequence have such unique properties, and are being discovered in such quantities, that one can rightly claim that a new field at the interface of planetary science and and astronomy is being born. In this review, we explore the essential elements of the theory of brown dwarfs and giant planets, as well as of the new spectroscopic classes L and T. To this end, we describe their evolution, spectra, atmospheric compositions, chemistry, physics, and nuclear phases and explain the basic systematics of substellar-mass objects across three orders of magnitude in both mass and age and a factor of 30 in effective temperature. Moreover, we discuss the distinctive features of those extrasolar giant planets that are irradiated by a central primary, in particular their reflection spectra, albedos, and transits. Aspects of the latest theory of Jupiter and Saturn are also presented. Throughout, we highlight the effects of condensates, clouds, molecular abundances, and molecular/atomic opacities in brown dwarf and giant planet atmospheres and summarize the resulting spectral diagnostics. Where possible, the theory is put in its current observational context.Comment: 67 pages (including 36 figures), RMP RevTeX LaTeX, accepted for publication in the Reviews of Modern Physics. 30 figures are color. Most of the figures are in GIF format to reduce the overall size. The full version with figures can also be found at: http://jupiter.as.arizona.edu/~burrows/papers/rm